The basic cyclic scheduling problem with linear precedence constraints
نویسندگان
چکیده
منابع مشابه
The Basic Cyclic Scheduling Problem with Linear Precedence Constraints
In this paper, we consider a nite set of generic tasks that we execute a large number of times. We introduce the linear constraints between two generic tasks : the di erence of iteration indices between the execution of two tasks subject to a precedence constraint is a linear function of these indices. These constraints are modeled by a linear graph G. Moreover, we consider no resource constrai...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملThree-machine Scheduling Problem with Precedence Constraints
This paper deals with a three-machine flow-shop problem in which some of the job sequences are infeasible. It is assumed that jobs are grouped into several disJoint subsets within which a job order is pre-determined. Once the first job in a group has started on a machine, then the entire group must be completed on the machine without starting a job which does not belong to the group. It is furt...
متن کاملThe basic cyclic scheduling problem with deadlines
The purpose of this paper is to study the latest schedule existence, calculation and properties of a basic cyclic scheduling problem with deadlines. First it is shown that, in the general case, a latest schedule exists but may be difficult to compute. Then we focus on a special case we call the optimal cyclic production problem. We derive an upper bound for the number of maximal-path values nee...
متن کاملThe Complexity of a Cyclic Scheduling Problem With Identical Machines and Precedence Constraints
Abstract We consider a set T of tasks with unit processing times. Each of them must be executed in nitely often. A uniform constraint is de ned between two tasks and induces a set of precedence constraints on their successive executions. We limit our study to a subset of uniform constraints corresponding to two hypotheses often veri ed in practice : each execution of T must end by a special tas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00126-x